GRASP strategies for a bi-objective commercial territory design problem
نویسندگان
چکیده
In this work a problem motivated by a real-world case from a beverage distribution firm in Mexico is addressed. Different planning criteria are taken into account in order to create acceptable territory designs. Namely, each territory needs to be compact, connected and balanced according to two attributes (number of costumers and product demand). Two GRASP based heuristics (BGRASP and TGRASP) are proposed for this NP-hard combinatorial optimization problem. For each of them two variants are studied: i) keeping connectivity as a hard constraint during construction and post-processing phases and, ii) ignoring connectivity during the construction phase and adding this as a minimizing objective function during the post-processing phase . The main difference between BGRASP and TGRASP is the way they consider the planning criteria during the construction phase. In BGRASP, the construction attempts to find high quality solutions based on the optimization of two criteria: compactness and balancing according to the number of customers, that is, demand is treated as a constraint. The construction phase in TGRASP considers three objectives to be optimized: compactness and balancing with respect to the two attributes (number of customers and demand). That is, the demand balancing constraints are relaxed and treated as part of the objective function. The proposed procedures are evaluated on a variety of problem instances, with 500 and 1000 basic units. We carried out an analysis of these procedures using different performance measures such as number of non-dominated points, k-distance, size of the space cover (SSC), coverage of two sets measure, and time. We observed that, SSC, coverage of two sets measure and time, present significant variation depending on the GRASP procedure used. The number of points and k-distance measures did not present significant variation over all evaluated procedures. BGRASP-I provides good frontiers in shortest time and BGRASP-II has the best coverage of the efficient points given by the others procedures.
منابع مشابه
A GRASP with Strategic Oscillation for a Commercial Territory Design Problem with a Routing Budget Constraint
This paper addresses a commercial districting problem arising in the bottled beverage distribution industry. The problem consists of grouping a set of city blocks into territories so as to maximize territory compactness. As planning requirements, the grouping seeks to balance both number of customers and product demand across territories, maintain connectivity of territories, and limit the tota...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملMultiobjective scatter search for a commercial territory design problem
In this paper, a multiobjective scatter search procedure for a bi-objective territory design problem is proposed. A territory design problem consist of partitioning a set of basic units into larger groups that are suitable with respect to some specific planning criteria. These groups must be compact, connected, and balanced with respect to the number of customers and sales volume. The bi-object...
متن کاملA reactive GRASP for a commercial territory design problem with multiple balancing requirements
In this paper we present a Reactive GRASP approach to a commercial territory design problem motivated by a real-world application in a beverage distribution firm. The mathematical framework includes, as planning criteria, minimizing a measure of territory dispersion, balancing the different node activity measures among territories and territory contiguity. The proposed GRASP approach incorporat...
متن کاملA Bi-objective Mathematical Model for Closed-loop Supply Chain Network Design Problem
In this paper, a bi-objective mixed-integer linear optimization model for Closed-loop Supply Chain Network Design Problem (CLSCND) is developed. The proposed model includes both the forward and reverse directions and includes different types of facilities, namely, manufacturing/remanufacturing centers, warehouses, and disassembly centers. The first objective function tried to minimize the total...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Heuristics
دوره 19 شماره
صفحات -
تاریخ انتشار 2013